Interactive Segmentation Algorithm Based on Improved Random Walk
نویسندگان
چکیده
منابع مشابه
A Random-Walk Based Breast Tumors Segmentation Algorithm for Mammograms
Mammography is a commonly performed imaging study for screening breast cancer. One of the crucial elements of the mammogram processing is an accurate segmentation of the breast tumor region from a mammogram because it directly influences the subsequent analyzing accuracy and the processing speed of the mammogram. The goal of this paper is to propose an accurate and efficient algorithm of breast...
متن کاملAn Improved Random Walk Based Community Detection Algorithm
Community detection is an important issue in social network analysis, which aims at finding potential community structures such that the internal nodes of a community have higher closeness than external nodes. Taking into account node attribute information, this paper presents an improved community detection algorithm based on random walk. Based on the basic understanding that people getting to...
متن کاملA Novel Clustering Algorithm Based on Quantum Random Walk
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one dimensional QRW. Then, the probability distributions on the positions induced by QRW in these algorithms are investigated, which also indicates the possibility of ob...
متن کاملImage Segmentation Algorithm Based on Improved Ant Colony Algorithm
In the process of image segmentation, the basic ant colony algorithm has some disadvantages, such as long searching time, large amounts of calculation, and rough image segmentation results. This paper proposes an improved ant colony algorithm. Applying different transfer rules and pheromone update strategies to different regions of an image, including background, target, edge and noise, we deve...
متن کاملA Random Walk on Rectangles Algorithm
In this article, we introduce an algorithm that simulates efficiently the first exit time and position from a rectangle (or a parallelepiped) for a Brownian motion that starts at any point inside. This method provides an exact way to simulate the first exit time and position from any polygonal domain and then to solve some Dirichlet problems, whatever the dimension. This method can be used as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/itme2017/7966